The existing two-dimensional codes have the problems of weak antipollution ability and slow decoding speed in complex environment. To solve these problems， a very short antipollution error correcting code based on global distance optimization was proposed. Firstly， a concave-convex polygon mathematical model was constructed to characterize the polluted environment. Then， a very short error correcting code was designed， which uses three coding points to represent one target data bit. Finally， a coding point arrangement method was designed， which optimizes the global distance within a limited constrained domain. The corresponding decoding algorithm was also given. The antipollution ability and recognition speed of very short error correcting code were simulated and analyzed， and the proposed code was compared with the classical Bose-Chaudhuri-Hocquenghem （BCH） codes. The results show that when the target data length is 18 and the number of coding points is 63， the recognition accuracy of very short error correcting code is close to that of BCH codes in the same polluted environment with the decoding speed of 130 times of that of BCH codes. The proposed code also has the obvious advantages of simple and clear structure， strong adaptability of coding points， and being easy to be standardized and popularized.